0.00/0.05 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.20/0.46 % Computer : n010.cluster.edu 0.20/0.46 % Model : x86_64 x86_64 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.20/0.46 % Memory : 8046.5625MB 0.20/0.46 % OS : Linux 6.8.0-71-generic 0.20/0.46 % CPULimit : 1440 0.20/0.46 % WCLimit : 180 0.20/0.46 % DateTime : Mon Jul 27 11:10:19 UTC 2026 0.20/0.46 % CPUTime : 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.24/0.53 Running higher-order theorem proving 0.24/0.54 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.T3wHdSob0n/E---3.1_1028512.p 0.24/0.60 % Version: 3.5.1-ho 0.24/0.60 % Preprocessing class: HSSSSMSSMLSNHSN. 0.24/0.60 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.24/0.60 % Starting new_ho_9 with 900s (5) cores 0.24/0.60 % Starting post_as_ho1 with 180s (1) cores 0.24/0.60 % Starting sh1l with 180s (1) cores 0.24/0.60 % Starting post_as_ho10 with 180s (1) cores 0.24/0.60 % post_as_ho1 with pid 1028526 completed with status 0 0.24/0.60 % Result found by post_as_ho1 0.24/0.60 % Preprocessing class: HSSSSMSSMLSNHSN. 0.24/0.60 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.24/0.60 % Starting new_ho_9 with 900s (5) cores 0.24/0.60 % Starting post_as_ho1 with 180s (1) cores 0.24/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 0.24/0.60 % No SInE strategy applied 0.24/0.60 % Search class: HGHNF-FFSS00-SHSSMFNN 0.24/0.60 % Scheduled 7 strats onto 1 cores with 180 seconds (180 total) 0.24/0.60 % Starting SubtermCWHack with 17s (1) cores 0.24/0.60 % SubtermCWHack with pid 1028529 completed with status 0 0.24/0.60 % Result found by SubtermCWHack 0.24/0.60 % Preprocessing class: HSSSSMSSMLSNHSN. 0.24/0.60 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.24/0.60 % Starting new_ho_9 with 900s (5) cores 0.24/0.60 % Starting post_as_ho1 with 180s (1) cores 0.24/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 0.24/0.60 % No SInE strategy applied 0.24/0.60 % Search class: HGHNF-FFSS00-SHSSMFNN 0.24/0.60 % Scheduled 7 strats onto 1 cores with 180 seconds (180 total) 0.24/0.60 % Starting SubtermCWHack with 17s (1) cores 0.24/0.60 % Preprocessing time : 0.002 s 0.24/0.60 0.24/0.60 % Proof found! 0.24/0.60 % SZS status Theorem 0.24/0.60 % SZS output start CNFRefutation 0.24/0.60 thf(decl_24, type, inv: ($i > $i > $o) > $i > $i > $o). 0.24/0.60 thf(decl_33, type, asymm: ($i > $i > $o) > $o). 0.24/0.60 thf(decl_35, type, trans: ($i > $i > $o) > $o). 0.24/0.60 thf(decl_40, type, so: ($i > $i > $o) > $o). 0.24/0.60 thf(decl_52, type, epred1_0: $i > $i > $o). 0.24/0.60 thf(decl_53, type, esk1_0: $i). 0.24/0.60 thf(decl_54, type, esk2_0: $i). 0.24/0.60 thf(decl_55, type, esk3_0: $i). 0.24/0.60 thf(decl_56, type, esk4_0: $i). 0.24/0.60 thf(decl_57, type, esk5_0: $i). 0.24/0.60 thf(strict_order, axiom, ((so)=(^[X1:$i > $i > $o]:((((asymm @ X1))&((trans @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.T3wHdSob0n/E---3.1_1028512.p', strict_order)). 0.24/0.60 thf(asymmetric, axiom, ((asymm)=(^[X1:$i > $i > $o]:(![X3:$i, X4:$i]:((((X1 @ X3 @ X4))=>(~((X1 @ X4 @ X3)))))))), file('/export/starexec/sandbox2/tmp/tmp.T3wHdSob0n/E---3.1_1028512.p', asymmetric)). 0.24/0.60 thf(transitive, axiom, ((trans)=(^[X1:$i > $i > $o]:(![X3:$i, X4:$i, X6:$i]:((((((X1 @ X3 @ X4))&((X1 @ X4 @ X6))))=>((X1 @ X3 @ X6))))))), file('/export/starexec/sandbox2/tmp/tmp.T3wHdSob0n/E---3.1_1028512.p', transitive)). 0.24/0.60 thf(inverse_of_strict_order_is_strict_order, conjecture, ![X1:$i > $i > $o]:(((so @ X1)=>(so @ (inv @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.T3wHdSob0n/E---3.1_1028512.p', inverse_of_strict_order_is_strict_order)). 0.24/0.60 thf(inverse, axiom, ((inv)=(^[X1:$i > $i > $o, X3:$i, X4:$i]:((X1 @ X4 @ X3)))), file('/export/starexec/sandbox2/tmp/tmp.T3wHdSob0n/E---3.1_1028512.p', inverse)). 0.24/0.60 thf(c_0_5, plain, ((so)=(^[Z0:$i > $i > $o]:((((![X39:$i, X40:$i]:((((Z0 @ X39 @ X40))=>(~((Z0 @ X40 @ X39)))))))&((![X41:$i, X42:$i, X43:$i]:((((((Z0 @ X41 @ X42))&((Z0 @ X42 @ X43))))=>((Z0 @ X41 @ X43)))))))))), inference(fof_simplification,[status(thm)],[strict_order])). 0.24/0.60 thf(c_0_6, plain, ((asymm)=(^[Z0:$i > $i > $o]:(![X3:$i, X4:$i]:((((Z0 @ X3 @ X4))=>(~((Z0 @ X4 @ X3)))))))), inference(fof_simplification,[status(thm)],[asymmetric])). 0.24/0.60 thf(c_0_7, plain, ((trans)=(^[Z0:$i > $i > $o]:(![X3:$i, X4:$i, X6:$i]:((((((Z0 @ X3 @ X4))&((Z0 @ X4 @ X6))))=>((Z0 @ X3 @ X6))))))), inference(fof_simplification,[status(thm)],[transitive])). 0.24/0.60 thf(c_0_8, negated_conjecture, ~(![X1:$i > $i > $o]:(((so @ X1)=>(so @ (inv @ X1))))), inference(assume_negation,[status(cth)],[inverse_of_strict_order_is_strict_order])). 0.24/0.60 thf(c_0_9, plain, ((inv)=(^[Z0:$i > $i > $o, Z1:$i, Z2:$i]:((Z0 @ Z2 @ Z1)))), inference(fof_simplification,[status(thm)],[inverse])). 0.24/0.60 thf(c_0_10, plain, ((so)=(^[Z0:$i > $i > $o]:((((![X39:$i, X40:$i]:((((Z0 @ X39 @ X40))=>(~((Z0 @ X40 @ X39)))))))&((![X41:$i, X42:$i, X43:$i]:((((((Z0 @ X41 @ X42))&((Z0 @ X42 @ X43))))=>((Z0 @ X41 @ X43)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5, c_0_6]), c_0_7])). 0.24/0.60 thf(c_0_11, negated_conjecture, ~(![X1:$i > $i > $o]:(((![X158:$i, X159:$i]:(((X1 @ X158 @ X159)=>~((X1 @ X159 @ X158))))&![X160:$i, X161:$i, X162:$i]:((((X1 @ X160 @ X161)&(X1 @ X161 @ X162))=>(X1 @ X160 @ X162))))=>(![X163:$i, X164:$i]:(((X1 @ X164 @ X163)=>~((X1 @ X163 @ X164))))&![X165:$i, X166:$i, X167:$i]:((((X1 @ X166 @ X165)&(X1 @ X167 @ X166))=>(X1 @ X167 @ X165))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8, c_0_9]), c_0_10])). 0.24/0.60 thf(c_0_12, negated_conjecture, ![X169:$i, X170:$i, X171:$i, X172:$i, X173:$i]:((((~(epred1_0 @ X169 @ X170)|~(epred1_0 @ X170 @ X169))&(~(epred1_0 @ X171 @ X172)|~(epred1_0 @ X172 @ X173)|(epred1_0 @ X171 @ X173)))&(((((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk2_0 @ esk1_0))&((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk2_0 @ esk1_0)))&(~(epred1_0 @ esk5_0 @ esk3_0)|(epred1_0 @ esk2_0 @ esk1_0)))&((((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0))&((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk2_0)))&(~(epred1_0 @ esk5_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])])). 0.24/0.60 thf(c_0_13, negated_conjecture, ![X3:$i, X4:$i, X6:$i]:(((epred1_0 @ X3 @ X6)|~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X4 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.24/0.60 thf(c_0_14, negated_conjecture, ((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.24/0.60 thf(c_0_15, negated_conjecture, ![X3:$i]:(((epred1_0 @ esk1_0 @ esk2_0)|(epred1_0 @ X3 @ esk3_0)|~((epred1_0 @ X3 @ esk4_0)))), inference(spm,[status(thm)],[c_0_13, c_0_14])). 0.24/0.60 thf(c_0_16, negated_conjecture, ((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.24/0.60 thf(c_0_17, negated_conjecture, ((epred1_0 @ esk1_0 @ esk2_0)|~((epred1_0 @ esk5_0 @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.24/0.60 thf(c_0_18, negated_conjecture, ![X4:$i, X3:$i]:((~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X4 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.24/0.60 thf(c_0_19, negated_conjecture, (epred1_0 @ esk1_0 @ esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])). 0.24/0.60 thf(c_0_20, negated_conjecture, ((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.24/0.60 thf(c_0_21, negated_conjecture, ~((epred1_0 @ esk2_0 @ esk1_0)), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.24/0.60 thf(c_0_22, negated_conjecture, (epred1_0 @ esk4_0 @ esk3_0), inference(sr,[status(thm)],[c_0_20, c_0_21])). 0.24/0.60 thf(c_0_23, negated_conjecture, ((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.24/0.60 thf(c_0_24, negated_conjecture, ((epred1_0 @ esk2_0 @ esk1_0)|~((epred1_0 @ esk5_0 @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.24/0.60 thf(c_0_25, negated_conjecture, ![X3:$i]:(((epred1_0 @ X3 @ esk3_0)|~((epred1_0 @ X3 @ esk4_0)))), inference(spm,[status(thm)],[c_0_13, c_0_22])). 0.24/0.60 thf(c_0_26, negated_conjecture, (epred1_0 @ esk5_0 @ esk4_0), inference(sr,[status(thm)],[c_0_23, c_0_21])). 0.24/0.60 thf(c_0_27, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])]), c_0_21]), ['proof']). 0.24/0.60 % SZS output end CNFRefutation 0.24/0.60 % Parsed axioms : 59 0.24/0.60 % Removed by relevancy pruning/SinE : 0 0.24/0.60 % Initial clauses : 37 0.24/0.60 % Removed in clause preprocessing : 29 0.24/0.60 % Initial clauses in saturation : 8 0.24/0.60 % Processed clauses : 23 0.24/0.60 % ...of these trivial : 0 0.24/0.60 % ...subsumed : 0 0.24/0.60 % ...remaining for further processing : 23 0.24/0.60 % Other redundant clauses eliminated : 0 0.24/0.60 % Clauses deleted for lack of memory : 0 0.24/0.60 % Backward-subsumed : 2 0.24/0.60 % Backward-rewritten : 7 0.24/0.60 % Generated clauses : 21 0.24/0.60 % ...of the previous two non-redundant : 18 0.24/0.60 % ...aggressively subsumed : 0 0.24/0.60 % Contextual simplify-reflections : 1 0.24/0.60 % Paramodulations : 19 0.24/0.60 % Factorizations : 0 0.24/0.60 % NegExts : 0 0.24/0.60 % Equation resolutions : 0 0.24/0.60 % Disequality decompositions : 0 0.24/0.60 % Total rewrite steps : 8 0.24/0.60 % ...of those cached : 6 0.24/0.60 % Propositional unsat checks : 0 0.24/0.60 % Propositional check models : 0 0.24/0.60 % Propositional check unsatisfiable : 0 0.24/0.60 % Propositional clauses : 0 0.24/0.60 % Propositional clauses after purity: 0 0.24/0.60 % Propositional unsat core size : 0 0.24/0.60 % Propositional preprocessing time : 0.000 0.24/0.60 % Propositional encoding time : 0.000 0.24/0.60 % Propositional solver time : 0.000 0.24/0.60 % Success case prop preproc time : 0.000 0.24/0.60 % Success case prop encoding time : 0.000 0.24/0.60 % Success case prop solver time : 0.000 0.24/0.60 % Current number of processed clauses : 12 0.24/0.60 % Positive orientable unit clauses : 3 0.24/0.60 % Positive unorientable unit clauses: 0 0.24/0.60 % Negative unit clauses : 3 0.24/0.60 % Non-unit-clauses : 6 0.24/0.60 % Current number of unprocessed clauses: 1 0.24/0.60 % ...number of literals in the above : 2 0.24/0.60 % Current number of archived formulas : 0 0.24/0.60 % Current number of archived clauses : 11 0.24/0.60 % Clause-clause subsumption calls (NU) : 72 0.24/0.60 % Rec. Clause-clause subsumption calls : 66 0.24/0.60 % Non-unit clause-clause subsumptions : 1 0.24/0.60 % Unit Clause-clause subsumption calls : 17 0.24/0.60 % Rewrite failures with RHS unbound : 0 0.24/0.60 % BW rewrite match attempts : 1 0.24/0.60 % BW rewrite match successes : 1 0.24/0.60 % Condensation attempts : 0 0.24/0.60 % Condensation successes : 0 0.24/0.60 % Termbank termtop insertions : 3598 0.24/0.60 % Search garbage collected termcells : 912 0.24/0.60 0.24/0.60 % ------------------------------------------------- 0.24/0.60 % User time : 0.011 s 0.24/0.60 % System time : 0.003 s 0.24/0.60 % Total time : 0.014 s 0.24/0.60 % Maximum resident set size: 3940 pages 0.24/0.60 0.24/0.60 % ------------------------------------------------- 0.24/0.60 % User time : 0.013 s 0.24/0.60 % System time : 0.008 s 0.24/0.60 % Total time : 0.021 s 0.24/0.60 % Maximum resident set size: 4864 pages 0.24/0.60 % E exiting 0.24/0.60 EOF